Coupled rank-(Lm, Ln, •) block term decomposition by coupled block simultaneous generalized Schur decomposition
نویسندگان
چکیده
Coupled decompositions of multiple tensors are fundamental tools for multi-set data fusion. In this paper, we introduce a coupled version of the rank-(Lm, Ln, ·) block term decomposition (BTD), applicable to joint independent subspace analysis. We propose two algorithms for its computation based on a coupled block simultaneous generalized Schur decomposition scheme. Numerical results are given to show the performance of the proposed algorithms.
منابع مشابه
A Hierarchical Low-rank Schur Complement Preconditioner for Indefinite Linear Systems
Nonsymmetric and highly indefinite linear systems can be quite difficult to solve via iterative methods. This paper combines ideas from the Multilevel Schur Low-Rank preconditioner developed by Y. Xi, R. Li, and Y. Saad [SIAM J. Matrix Anal., 37 (2016), pp. 235–259] with classic block preconditioning strategies in order to handle this case. The method to be described generates a tree structure ...
متن کاملModelling and Estimation of Hammerstein System with Preload Nonlinearity
This paper deals with modelling and parameter identification of nonlinear systems described by Hammerstein model having asymmetric static nonlinearities known as preload nonlinearity characteristic. The simultaneous use of both an easy decomposition technique and the generalized orthonormal bases leads to a particular form of Hammerstein model containing a minimal parameters number. The employ ...
متن کاملFitting Coupled Geometric Objects for Metric Vision
A new approach to fitting coupled geometric objects, such as concentric circles, is presented. The objects can be coupled via common Grassmannian coefficients or through a correlation constraint on their coefficients. The implicit partitioning and partial block diagonal structure of the design matrix enables an efficient orthogonal residualization based on a generalized Eckart-Young-Mirsky matr...
متن کاملRandomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
Since being analyzed by Rokhlin, Szlam, and Tygert [1] and popularized by Halko, Martinsson, and Tropp [2], randomized Simultaneous Power Iteration has become the method of choice for approximate singular value decomposition. It is more accurate than simpler sketching algorithms, yet still converges quickly for any matrix, independently of singular value gaps. After Õ(1/ ) iterations, it gives ...
متن کاملBlock recursive LU preconditioners for the thermally coupled incompressible inductionless MHD problem
The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirab...
متن کامل